113 research outputs found
Information Cascades on Arbitrary Topologies
In this paper, we study information cascades on graphs. In this setting, each
node in the graph represents a person. One after another, each person has to
take a decision based on a private signal as well as the decisions made by
earlier neighboring nodes. Such information cascades commonly occur in practice
and have been studied in complete graphs where everyone can overhear the
decisions of every other player. It is known that information cascades can be
fragile and based on very little information, and that they have a high
likelihood of being wrong.
Generalizing the problem to arbitrary graphs reveals interesting insights. In
particular, we show that in a random graph , for the right value of
, the number of nodes making a wrong decision is logarithmic in . That
is, in the limit for large , the fraction of players that make a wrong
decision tends to zero. This is intriguing because it contrasts to the two
natural corner cases: empty graph (everyone decides independently based on his
private signal) and complete graph (all decisions are heard by all nodes). In
both of these cases a constant fraction of nodes make a wrong decision in
expectation. Thus, our result shows that while both too little and too much
information sharing causes nodes to take wrong decisions, for exactly the right
amount of information sharing, asymptotically everyone can be right. We further
show that this result in random graphs is asymptotically optimal for any
topology, even if nodes follow a globally optimal algorithmic strategy. Based
on the analysis of random graphs, we explore how topology impacts global
performance and construct an optimal deterministic topology among layer graphs
Solving the Batch Stochastic Bin Packing Problem in Cloud: A Chance-constrained Optimization Approach
This paper investigates a critical resource allocation problem in the first
party cloud: scheduling containers to machines. There are tens of services and
each service runs a set of homogeneous containers with dynamic resource usage;
containers of a service are scheduled daily in a batch fashion. This problem
can be naturally formulated as Stochastic Bin Packing Problem (SBPP). However,
traditional SBPP research often focuses on cases of empty machines, whose
objective, i.e., to minimize the number of used machines, is not well-defined
for the more common reality with nonempty machines. This paper aims to close
this gap. First, we define a new objective metric, Used Capacity at Confidence
(UCaC), which measures the maximum used resources at a probability and is
proved to be consistent for both empty and nonempty machines, and reformulate
the SBPP under chance constraints. Second, by modeling the container resource
usage distribution in a generative approach, we reveal that UCaC can be
approximated with Gaussian, which is verified by trace data of real-world
applications. Third, we propose an exact solver by solving the equivalent
cutting stock variant as well as two heuristics-based solvers -- UCaC best fit,
bi-level heuristics. We experimentally evaluate these solvers on both synthetic
datasets and real application traces, demonstrating our methodology's advantage
over traditional SBPP optimal solver minimizing the number of used machines,
with a low rate of resource violations.Comment: To appear in SIGKDD 2022 as Research Track pape
Software Defined Batteries
Abstract Different battery chemistries perform better on different axes, such as energy density, cost, peak power, recharge time, longevity, and efficiency. Mobile system designers are constrained by existing technology, and are forced to select a single chemistry that best meets their diverse needs, thereby compromising other desirable features. In this paper, we present a new hardware-software system, called Software Defined Battery (SDB), which allows system designers to integrate batteries of different chemistries. SDB exposes APIs to the operating system which control the amount of charge flowing in and out of each battery, enabling it to dynamically trade one battery property for another depending on application and/or user needs. Using microbenchmarks from our prototype SDB implementation, and through detailed simulations, we demonstrate that it is possible to combine batteries which individually excel along different axes to deliver an enhanced collective performance when compared to traditional battery packs
Topology Control meets SINR: The Scheduling Complexity of Arbitrary Topologies
To date, topology control in wireless ad hoc and sensor networksâthe study of how to compute from the given communication network a subgraph with certain beneficial propertiesâhas been considered as a static problem only; the time required to actually schedule the links of a computed topology without message collision was generally ignored. In this paper we analyze topology control in the context of the physical Signal-to-Interference-plus-Noise-Ratio (SINR) model, focusing on the question of how and how fast the links of a resulting topology can actually be realized over time. For this purpose, we define and study a generalized version of the SINR model and obtain theoretical upper bounds on the scheduling complexity of arbitrary topologies in wireless networks. Specifically, we prove that even in worst-case networks, if the signals are transmitted with correctly assigned transmission power levels, the number of time slots required to successfully schedule all links of an arbitrary topology is proportional to the squared logarithm of the number of network nodes times a previously defined static interference measure. Interestingly, although originally considered without explicit accounting for signal collision in the SINR model, this static interference measure plays an important role in the analysis of link scheduling with physical link interference. Our result thus bridges the gap between static graph-based interference models and the physical SINR model. Based on these results, we also show that when it comes to scheduling, requiring the communication links to be symmetric may imply significantly higher costs as opposed to topologies allowing unidirectional links
ABSTRACT When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game
Over the last years, game theory has provided great insights into the behavior of distributed systems by modeling the players as utilitymaximizing agents. In particular, it has been shown that selfishness causes many systems to perform in a globally suboptimal fashion. Such systems are said to have a large Price of Anarchy. In this paper, we extend this active field of research by allowing some players to be malicious or Byzantine rather than selfish. We ask: What is the impact of Byzantine players on the systemâs efficiency compared to purely selfish environments or compared to the social optimum? In particular, we introduce the Price of Malice which captures this efficiency degradation. As an example, we analyze the Price of Malice of a game which models the containment of the spread of viruses. In this game, each node can choose whether or not to install anti-virus software. Then, a virus starts from a random node and iteratively infects all neighboring nodes which are not inoculated. We establish various results about this game. For instance, we quantify how much the presence of Byzantine players can deteriorate orâin case of highly risk-averse selfish playersâimprove the social welfare of the distributed system
ABSTRACT On the Topologies Formed by Selfish Peers â
Current peer-to-peer (P2P) systems often suffer from a large fraction of freeriders not contributing any resources to the network. Various mechanisms have been designed to overcome this problem. However, the selfish behavior of peers has aspects which go beyond resource sharing. This paper studies the effects on the topology of a P2P network if peers selfishly select the peers to connect to. In our model, a peer exploits locality properties in order to minimize the latency (or response times) of its lookup operations. At the same time, the peer aims at not having to maintain links to too many other peers in the system. By giving tight bounds on the price of anarchy, we show that the resulting topologies can be much worse than if peers collaborated. Moreover, the network may never stabilize, even in the absence of churn. Finally, we establish the complexity of Nash equilibria in our game theoretic model of P2P networks. Specifically, we prove that it is NP-hard to decide whether our game has a Nash equilibrium and can stabilize
Rationality and Theory
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, achieves an O ( â k(mÏ) 1/ â k log (m + n)) approximation in O(k) communication rounds where message size is bounded to O(log n) bits. The number of facilities and clients are m and n, respectively, and Ï is a coefficient that depends on the cost values of the instance. Our technique is based on a distributed primal-dual approach for approximating a linear program, that does not form a covering or packing program
Efficient computation of maximal independent sets in unstructured multi-hop radio networks
Abstract â When being deployed, ad-hoc and sensor networks are unstructured and lack an efficient and reliable communication scheme. Hence, the organization of a MAC layer is the primary goal during and immediately after the deployment of such networks. Computing a good initial clustering facilitates this task and is therefore a vital part of the initialization process. A clustering based on a maximal independent set provides several highly desirable properties. Besides yielding a dominating set of good quality, such a clustering avoids interference between clusterheads, thus allowing efficient communication. We propose a novel algorithm that works under a model capturing the characteristics of the initialization phase of unstructured radio networks, i.e., asynchronous wake-up, scarce knowledge about the topology of the network graph, no collision detection, and the hidden terminal problem. We show that even under these hard conditions, the algorithm computes a maximal independent set in polylogarithmic time. I
- âŠ